Multivariate Refinable Functions of High Approximation Order Via Quotient Ideals of Laurent Polynomials
نویسندگان
چکیده
We give an algebraic interpretation of the well–known “zero–condition” or “sum rule” for multivariate refinable functions with respect to an arbitrary scaling matrix. The main result is a characterization of these properties in terms of containment in a quotient ideal, however not in the ring of polynomials but in the ring of Laurent polynomials.
منابع مشابه
Efficient Optimum Design of Steructures With Reqency Response Consteraint Using High Quality Approximation
An efficient technique is presented for optimum design of structures with both natural frequency and complex frequency response constraints. The main ideals to reduce the number of dynamic analysis by introducing high quality approximation. Eigenvalues are approximated using the Rayleigh quotient. Eigenvectors are also approximated for the evaluation of eigenvalues and frequency responses. A tw...
متن کاملApproximation properties of multivariate wavelets
Wavelets are generated from refinable functions by using multiresolution analysis. In this paper we investigate the approximation properties of multivariate refinable functions. We give a characterization for the approximation order provided by a refinable function in terms of the order of the sum rules satisfied by the refinement mask. We connect the approximation properties of a refinable fun...
متن کاملSymmetric Multivariate Orthogonal Refinable Functions
In this paper, we shall investigate the symmetry property of a multivariate orthogonal M -refinable function with a general dilation matrix M . For an orthogonal M -refinable function φ such that φ is symmetric about a point (centro-symmetric) and φ provides approximation order k, we show that φ must be an orthogonal M -refinable function that generates a generalized coiflet of order k. Next, w...
متن کاملProjectable Multivariate Refinable Functions and Biorthogonal Wavelets
A biorthogonal wavelet is derived from a pair of biorthogonal refinable functions using the standard technique in multiresolution analysis. In this paper, we introduce the concept of projectable refinable functions and demonstrate that many multivariate refinable functions are projectable; that is, they essentially carry the tensor product (separable) structure though themselves may be non-tens...
متن کاملOptimized refinable enclosures of multivariate polynomial pieces
An enclosure is a two-sided approximation of a unior multivariate function by a pair of typically simpler functions such that over the domain of interest. Enclosures are optimized by minimizing the width and refined by enlarging the space . This paper develops a framework for efficiently computing enclosures for multivariate polynomials and, in particular, derives piecewise bilinear enclosures ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Adv. Comput. Math.
دوره 20 شماره
صفحات -
تاریخ انتشار 2004